Solving the TSP Using Chaotic Simulated Annealing
نویسنده
چکیده
منابع مشابه
A Mushy State Simulated Annealing
It is a long time that the Simulated Annealing (SA) procedure has been introduced as a model-free optimization for solving NP-hard problems. Improvements from the standard SA in the recent decade mostly concentrate on combining its original algorithm with some heuristic methods. These modifications are rarely happened to the initial condition selection methods from which the annealing schedules...
متن کاملNumerical Algorithm to Hardware Implementation {
| We review the approaches for solving combinatorial optimization problems by chaotic dynamics. We mention both numerical algorithms with chaotic neural networks and hardware implementation. I. Chaos for avoiding local minima A. Mutual Connection Neural Network Dynamics Various methods are proposed for solving NP-hard combinatorial optimization problems, for example, traveling salesman problem ...
متن کاملChaotic simulated annealing with decaying chaotic noise
By adding chaotic noise to each neuron of the discrete-time continuous-output Hopfield neural network (HNN) and gradually reducing the noise, a chaotic neural network is proposed so that it is initially chaotic but eventually convergent, and, thus, has richer and more flexible dynamics compared to the HNN. The proposed network is applied to the traveling salesman problem (TSP) and that results ...
متن کاملSimulation Study on Parameters of SLF Chaotic Neural Network Model
A novel chaotic-neuron model is presented by introducing the non-monotonous activation function which is composed of the Legendre function and the Sigmoid function. The reversed bifurcation of the chaotic neuron model is given and analyzed, meanwhile, how do parameters influence the network convergence speed is discussed. Based on the neuron model, the piecewise simulated annealing SLF chaotic ...
متن کاملChaotic Neural Networks and Their Applications
Many difficult combinatorial optimization problems arising from science and technology are often difficult to solve exactly. Hence a great number of approximate algorithms for solving combinatorial opthintion problems have been developed [lo], [IS]. Hopfield and Tank applied the continuowtime, continuous-output Hopfield neural network (CTCGH?W) to TSP, thereby initialing a new approach to optim...
متن کامل